A note on López-Dahab coordinates

Speeding up Elliptic Curve Scalar Multiplication without Precomputation

This paper presents a series of Montgomery scalar multiplication algorithms on general short Weierstrass curves over odd characteristic fields, which need only 12 field multiplications plus 12 ∼ 20 field additions per scalar bit using 8 ∼ 10 field registers, thus significantly outperform the binary NAF method on average. Over binary fields, the Montgomery scalar multiplication algorithm which w...

Faster Repeated Doublings on Binary Elliptic Curves

The use of precomputed data to speed up a cryptographic protocol is commonplace. For instance, the owner of a public point P on an elliptic curve can precompute various points of the form [2]P and transmit them together with P . One inconvenience of this approach though may be the amount of information that needs to be exchanged. In the situation where the bandwidth of the transmissions is limi...

On Humbert matrix function of two complex variables under differential operator

A Note on the String Analog of N = 2 Super - Symmetric

A connection between the conifold locus of the type II string on the W P 4 11226 Calabi-Yau manifold and the geometry of the quantum moduli of N =2 SU(2) super Yang-Mills is presented. This relation is obtained from the anomalous behaviour of the SU(2) super Yang-Mills special coordinates under S-duality transformation in Sl(2;Z)/Γ2.

TinyTate: Identity-Based Encryption for Sensor Networks

In spite of several years of intense research, the area of security and cryptography in Wireless Sensor Networks (WSNs) still has a number of open problems. On the other hand, the advent of Identity-Based Encryption (IBE) has enabled a wide range of new cryptographic solutions. In this work, we argue that IBE is ideal for WSNs and vice versa. We discuss the synergy between the systems, describe...